Application of OBDD Diagrams in Verification of Tabular Rule Systems
نویسندگان
چکیده
This paper examines the application of Ordered Binary Decision Diagrams (OBDD) to modelling and verification of quality properties of rule systems. The transformation of an intentional specification of a tabular rule system into OBDD data structures was proposed and techniques of verification of such quality properties as completeness, determinism and redundancy of rules were described.
منابع مشابه
High-level Methods for OBDD-based Sequential Verification
Today, usage of complex circuit designs in computers, in multimedia applications and communication devices is widespread and still increasing. At the same time, due to Moore’s Law we do not expect to see an end in the growth of the complexity of digital circuits. The decreasing ability of common validation techniques – like simulation – to assure correctness of a circuit design enlarges the nee...
متن کاملReordering Rule Makes OBDD Proof Systems Stronger
Atserias, Kolaitis, and Vardi [1] showed that the proof system of Ordered Binary Decision Diagrams with conjunction and weakening, OBDD(∧,weakening), simulates CP∗ (Cutting Planes with unary coefficients). We show that OBDD(∧,weakening) can give exponentially shorter proofs than dag-like cutting planes. This is proved by showing that the Clique-Coloring tautologies have polynomial size proofs i...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملThe I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. OBDDs have been successfully used to solve problems in e.g. digital-systems design, verification and testing, in mathematical logic, concurrent system design and in artificial intelligence. The OBDDs used in many of th...
متن کاملOn the OBDD Complexity of the Most Significant Bit of Integer Multiplication
Integer multiplication as one of the basic arithmetic functions has been in the focus of several complexity theoretical investigations. Ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for boolean functions. Among the many areas of application are verification, model checking, computer-aided design, relational algebra, and symbolic graph algorithms. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007